A Chaos Cloud Particle Swarm Algorithm Based Available Transfer Capability

نویسندگان

  • Hongsheng Su
  • Ying Qi
چکیده

A mathematical model for ATC based on optimal power flow was built under the static security constraints, where the maximum of all load nodes in receiving area was considered as aim function. In view of the defects of slow convergence and low accuracy in ATC optimization algorithms, a chaos cloud particle swarm optimization algorithm based on golden section criteria (CCGPSO) was proposed. This method classified the particle swarm into three populations based on golden section judge principles according to fitness level. They are called chaos cloud particles, cloud particles and standard particles respectively. Each population was operated by different processing operations and updating modes. Comparing with other methods, the numerical simulation results of CCGPSO in IEEE-30 bus system demonstrate the higher efficiency and validity in ATC calculation. It is more suitable for solving the largescale non-linear multi-constraint engineering practical problems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Integrated modeling and solving the resource allocation problem and task scheduling in the cloud computing environment

Cloud computing is considered to be a new service provider technology for users and businesses. However, the cloud environment is facing a number of challenges. Resource allocation in a way that is optimum for users and cloud providers is difficult because of lack of data sharing between them. On the other hand, job scheduling is a basic issue and at the same time a big challenge in reaching hi...

متن کامل

Cross-layer Packet-dependant OFDM Scheduling Based on Proportional Fairness

This paper assumes each user has more than one queue, derives a new packet-dependant proportional fairness power allocation pattern based on the sum of weight capacity and the packet’s priority in users’ queues, and proposes 4 new cross-layer packet-dependant OFDM scheduling schemes based on proportional fairness for heterogeneous classes of traffic. Scenario 1, scenario 2 and scenario 3 lead r...

متن کامل

The K-means Clustering Algorithm Based on Chaos Particle Swarm

Proposed the Algorithm of K-means (CPSOKM) based on Chaos Particle Swarm in order to solve the problem that K-means algorithm sensitive to initial conditions and is easy to influence the clustering effect. On the selection of the initial value problem, algorithm using particle swarm algorithm to balance the random value uncertainty, and then by introducing a chaotic sequence, the particles move...

متن کامل

Suppression of Chaotic Behavior in Duffing-holmes System using Backstepping Controller Optimized by Unified Particle Swarm Optimization Algorithm

The nonlinear behavior analysis and chaos control for Duffing-Holmes chaotic system is discussed in the paper. In order to suppress the irregular chaotic motion, an optimal backstepping controller is designed. The backstepping method consists of parameters with positive values. The improper selection of the parameters leads to inappropriate responses or even may lead to instability of the syste...

متن کامل

Research on Location Problem of Multi - distribution Center based on Chaos Adaptive Mutation Particle Swarm Optimization Algorithm

Location problem of multi-distribution center is a kind of NP hard problem. To solve such problems, this paper proposes a chaos adaptive mutation particle swarm optimization algorithm. The algorithm uses the ergodic property of chaos to initialize the particle swarm to enhance the diversity of the population, according to the variance of population fitness to adjust the probability of mutation,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013